more on this theme     |     more from this thinker


Single Idea 10894

[filed under theme 5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction ]

Full Idea

A propositional logic set of sentences Γ is 'satisfiable' if there is at least one admissible truth-assignment that makes all of its sentences true.

Gist of Idea

A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true

Source

José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4)

Book Ref

Zalabardo,José L.: 'Introduction to the Theory of Logic' [Westview 2000], p.53


The 18 ideas from 'Introduction to the Theory of Logic'

Determinacy: an object is either in a set, or it isn't [Zalabardo]
Specification: Determinate totals of objects always make a set [Zalabardo]
Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo]
The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo]
A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo]
If a set is defined by induction, then proof by induction can be applied to it [Zalabardo]
Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo]
A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo]
Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
A first-order 'sentence' is a formula with no free variables [Zalabardo]
The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo]
Logically true sentences are true in all structures [Zalabardo]
Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo]
Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo]
We can do semantics by looking at given propositions, or by building new ones [Zalabardo]